TRUTH TABLE - SMARANDACHLEY PRODUCT CORDIAL LABELING OF BLOOM TORUS GRAPH BTM,N
نویسندگان
چکیده
In this paper the researcher prepares truth table for labeling of Bloom Torus graph by admitting condition Smarandachely product cordial labelling. on is such a with induced
منابع مشابه
Product Cordial Labeling for Some New Graphs
Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملOn k-cordial labeling
Hovey [Discrete Math. 93 (1991), 183–194] introduced simultaneous generalizations of harmonious and cordial labellings. He defines a graph G of vertex set V (G) and edge set E(G) to be k-cordial if there is a vertex labelling f from V (G) to Zk, the group of integers modulo k, so that when each edge xy is assigned the label (f(x) + f(y)) (mod k), the number of vertices (respectively, edges) lab...
متن کاملPD-prime cordial labeling of graphs
vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of advanced research
سال: 2023
ISSN: ['2707-7802', '2707-7810']
DOI: https://doi.org/10.21474/ijar01/16303